package algorithms.tree;

public abstract class Tree<K, T extends Node<K>> {

	protected T rootNode;

	/**
	 * @return the rootNode
	 */
	public T getRootNode() {
		return rootNode;
	}

	/**
	 * @param rootNode
	 *            the rootNode to set
	 */
	public void setRootNode(T rootNode) {
		this.rootNode = rootNode;
	}

	abstract public String preorderTraversing();

	abstract public String inorderTraversing();

	abstract public String postorderTraversing();
}
